On Reduct Construction Algorithms

نویسندگان

  • Yiyu Yao
  • Yan Zhao
  • Jue Wang
چکیده

This paper critically analyzes reduct construction methods at two levels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic groups based on the underlying control structures. At a low level, by adopting different heuristics or fitness functions for attribute selection, one is able to derive most of the existing algorithms. The analysis brings new insights into the problem of reduct construction, and provides guidelines for the design of new algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deletion and Addition Methods for Reduct Construction

This paper extends the former study of reduct construction algorithms by taking an intensive study on two complementary control strategies: the deletion methods and the addition methods. Based on their differences and properties, they can be used to construct different kinds of reducts. The winning reducts of the left-to-right lexical order and the rightto-left lexical order can be constructed ...

متن کامل

Discernibility matrix simplification for constructing attribute reducts

This paper proposes a reduct construction method based on discernibility matrix simplification. The method works in a similar way to the classical Gaussian elimination method for solving a system of linear equations. Elementary matrix simplification operations are introduced. Each operation transforms a matrix into a simpler form. By applying these operations a finite number of times, one can t...

متن کامل

A General Definition of an Attribute Reduct

A reduct is a subset of attributes that are jointly sufficient and individually necessary for preserving a particular property of a given information table. A general definition of an attribute reduct is presented. Specifically, we discuss the following issues: First, there are a variety of properties that can be observed in an information table. Second, the preservation of a certain property b...

متن کامل

Sampling for Approximate Reduct in very Large Datasets

The rough set theory provides a formal framework for data mining. Reduct is the most important concept in rough set application to data mining. A reduct is the minimal attribute set preserving classification power of original dataset. Finding a reduct is similar to feature selection problem. In this paper, we propose two reduct algorithms. One is based on attribute frequency in discernibility m...

متن کامل

Pairwise Cores in Information Systems

A core in information system is a set of attributes globally necessary to distinct objects from different decision classes (i.e., the intersection of all reducts of the information system). A notion of a pairwise core (2-core), which naturally extends the definition of a core into the case of pairs of attributes is presented. Some useful features concerned with the graph representation of pairw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Trans. Computational Science

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2006